Displaying results 1 - 10 / 2267
results / page
What publication information is included in the service?
Publication name
Authors
Publication channel
Year
Publications information icon

Uniform spanning tree in topological polygons, partition functions for SLE(8), and correlations in c=−2 logarithmic CFT

Peer-reviewed
Open access
DOI
10.1214/24-AOP1700
Liu, Mingchang; Peltola, Eveliina; Wu, Hao
Annals of Probability2025Publications information icon

UST branches, martingales, and multiple SLE(2)

Peer-reviewed
Open access
DOI
10.1214/20-EJP485
Alex Karrila
Electronic Journal of Probability2020Publications information icon

Minimum Spanning Tree Problem with Fuzzy Intervals

Open access
Hokuni, Sami;Joki, Kaisa;Yli-Sipilä, Sari;Mäkelä, Marko;Nikulin, Yury
-2012Publications information icon

Cultural Boundary Spanning in Global Project Networks

Peer-reviewed
DiMarco, Melissa; Taylor, John E.; Alin, Pauli
-2009Publications information icon

A fast minimum spanning tree algorithm based on K-means

Peer-reviewed
DOI
10.1016/j.ins.2014.10.012
Zhong Caiming, Malinen Mikko, Miao Duoqian, Fränti Pasi
INFORMATION SCIENCES2014Publications information icon

Fast Approximate Minimum Spanning Tree Algorithm Based on K-Means

Peer-reviewed
DOI
10.1007/978-3-642-40261-6_31
Zhong Caiming, Malinen Mikko, Miao Duoqian, Fränti Pasi
LECTURE NOTES IN COMPUTER SCIENCE2013Publications information icon

A novel distributed spanning tree protocol for provider provisioned VPLS networks

Peer-reviewed
DOI
10.1109/ICC.2014.6883778
Liyanage, Madhusanka; Ylianttila, Mika; Gurtov, Andrei
IEEE International Conference on Communications2014Publications information icon

Minimum spanning tree based split-and-merge: A hierarchical clustering method

Peer-reviewed
Open access
Zhong Caiming; Miao Duoqian; Fränti Pasi
INFORMATION SCIENCES2011Publications information icon

MSTAR - a fast parallelized algorithmically regularized integrator with minimum spanning tree coordinates

Peer-reviewed
Open access
DOI
10.1093/mnras/staa084
Rantala, Antti; Pihajoki, Pauli; Mannerkoski, Matias; Johansson, Peter H.; Naab, Thorsten
Monthly Notices of the Royal Astronomical Society2020Publications information icon

Who buys whom: Information environments and organizational boundary spanning through acquisitions

Peer-reviewed
Schildt, Henri A.; Laamanen, Tomi
Strategic Organization2006

Uniform spanning tree in topological polygons, partition functions for SLE(8), and correlations in c=−2 logarithmic CFT

Peer-reviewed
Open access
DOI
10.1214/24-AOP1700
2025

UST branches, martingales, and multiple SLE(2)

Peer-reviewed
Open access
DOI
10.1214/20-EJP485
2020

Minimum Spanning Tree Problem with Fuzzy Intervals

Open access
2012

Cultural Boundary Spanning in Global Project Networks

Peer-reviewed
2009

A fast minimum spanning tree algorithm based on K-means

Peer-reviewed
DOI
10.1016/j.ins.2014.10.012
2014

Fast Approximate Minimum Spanning Tree Algorithm Based on K-Means

Peer-reviewed
DOI
10.1007/978-3-642-40261-6_31
2013

A novel distributed spanning tree protocol for provider provisioned VPLS networks

Peer-reviewed
DOI
10.1109/ICC.2014.6883778
2014

Minimum spanning tree based split-and-merge: A hierarchical clustering method

Peer-reviewed
Open access
2011

MSTAR - a fast parallelized algorithmically regularized integrator with minimum spanning tree coordinates

Peer-reviewed
Open access
DOI
10.1093/mnras/staa084
2020

Who buys whom: Information environments and organizational boundary spanning through acquisitions

Peer-reviewed
2006